An Algorithm for Decomposing Polynomial System into Normal Ascending Sets
نویسندگان
چکیده
We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets. If the polynomial system is 0-dimensional, the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.
منابع مشابه
On the Theories of Triangular Sets
Triangular sets appear under various names in many papers concerning systems of polynomial equations. Ritt (1932) introduced them as characteristic sets. He described also an algorithm for solving polynomial systems by computing characteristic sets of prime ideals and factorizing in field extensions. Characteristic sets of prime ideals have good properties but factorization in algebraic extensi...
متن کاملOn the Connection Between Ritt Characteristic Sets and Buchberger-Gröbner Bases
For any polynomial ideal I, let the minimal triangular set contained in the reduced Buchberger-Gröbner basis of I with respect to the purely lexicographical term order be called the W-characteristic set of I. In this paper, we establish a strong connection between Ritt’s characteristic sets and Buchberger’s Gröbner bases of polynomial ideals by showing that the W-characteristic set C of I is a ...
متن کاملCharacteristic set method for differential-difference polynomial systems
In this paper, we present a characteristic set method for mixed differential and difference polynomial systems. We introduce the concepts of coherent, regular, proper irreducible, and strongly irreducible ascending chains and study their properties. We give an algorithm which can be used to decompose the zero set for a finitely generated differential and difference polynomial sets into the unio...
متن کاملA characteristic set method for ordinary difference polynomial systems
We prove several basic properties for difference ascending chains including a necessary and sufficient condition for an ascending chain to be the characteristic set of its saturation ideal and a necessary and sufficient condition for an ascending chain to be the characteristic set of a reflexive prime ideal. Based on these properties, we propose an algorithm to decompose the zero set of a finit...
متن کاملDecomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible components. The computation of a linear trace for each factor certifies the decomposition. This factorization method exhibits a good practical performance o...
متن کامل